Microcanonical Optimization Applied to the Euclidean Steiner Problem in R
نویسندگان
چکیده
An enumerative scheme to solve this problem was proposed by Smith [11]. Maculan, Michelon and Xavier [7] formulated the ESTP as a nonconvex mixed-integer programming problem and proposed a Lagrangean dual program in order to develop a branch-and-bound method. A number of heuristic approaches have been developed in dimension n = 2 (see [13] for a survey). Heuristics for n ≥ 3 can be found in [6, 8, 9].
منابع مشابه
A Combinatorial Optimization Approach to the Stability of Biomacromolecular Structures
The application of optimization techniques derived from the study of Euclidean full Steiner Trees to macromolecules like proteins is reported in the present work. We shall use the concept of Euclidean Steiner Ratio Function (SRF) as a good Lyapunov function in order to perform an elementary stability analysis.
متن کاملTwo Heuristics for the Euclidean Steiner Tree Problem
The Euclidean Steiner tree problem is to find the tree with minimal Euclidean length spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set (Steiner points). The problem is NP-hard, so polynomial-time heuristics are desired. We present two such heuristics, both of which utilize an efficient method for computing a locally optimal tree with a given topol...
متن کاملComputing Steiner minimal trees in Euclidean d-space
In this paper, we propose modifications on Smith’s branch-and-bound (B&B) algorithm for the Euclidean Steiner problem in R. At each node of the B&B tree, we solve a convex programming problem in conic form to obtain a lower bound on the minimal Steiner tree length for a given topology. We also use conic formulation to obtain bounds on the child problems at a given node, that are applied on a st...
متن کاملA Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem
The Steiner problem is an NP-hard optimization problem which consists of finding the minimal-length tree connecting a set of N points in the Euclidean plane. Exact methods of resolution currently available are exponential in N , making exact minimal trees accessible for only small size problems (up to N ≈ 100). An acceptable suboptimal solution is provided by the minimum spanning tree (MST) whi...
متن کاملAn Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
In recent years rich theories on polynomial-time interior-point algorithms have been developed. These theories and algorithms can be applied to many nonlinear optimization problems to yield better complexity results for various applications. In this paper, the problem of minimizing a sum of Euclidean norms is studied. This problem is convex but not everywhere differentiable. By transforming the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001